منابع مشابه
Extremal algebraic connectivities of certain caterpillar classes and symmetric caterpillars
A caterpillar is a tree in which the removal of all pendant vertices makes it a path. Let d ≥ 3 and n ≥ 6 be given. Let Pd−1 be the path of d − 1 vertices and Sp be the star of p + 1 vertices. Let p = [p1, p2, ..., pd−1] such that p1 ≥ 1, p2 ≥ 1, ..., pd−1 ≥ 1. Let C (p) be the caterpillar obtained from the stars Sp1 , Sp2 , ..., Spd−1 and the path Pd−1 by identifying the root of Spi with the i...
متن کاملPretopology Semantics for Bimodal Intuitionistic Linear Logic
We present a complete pretopology semantics for a system of Intuitionistic Linear Logic (commutative or not) where the storage operator is split into a contraction and a weakening component and then recovered again from them. The semantics for weakening and contraction has been explored by Bart Jacobs 13] in a categorical setting. However, a completeness theorem is not given in 13] and the appr...
متن کاملEla Extremal Algebraic Connectivities of Certain Caterpillar Classes and Symmetric Caterpillars∗
A caterpillar is a tree in which the removal of all pendant vertices makes it a path. Let d ≥ 3 and n ≥ 6 be given. Let Pd−1 be the path of d − 1 vertices and Sp be the star of p + 1 vertices. Let p = [p1, p2, ..., pd−1] such that p1 ≥ 1, p2 ≥ 1, ..., pd−1 ≥ 1. Let C (p) be the caterpillar obtained from the stars Sp1 , Sp2 , ..., Spd−1 and the path Pd−1 by identifying the root of Spi with the i...
متن کاملClustering to Given Connectivities
We define a general variant of the graph clustering problem where the criterion of density for the clusters is (high) connectivity. In Clustering to Given Connectivities, we are given an n-vertex graph G, an integer k, and a sequence Λ = ⟨λ1, . . . , λt⟩ of positive integers and we ask whether it is possible to remove at most k edges from G such that the resulting connected components are exact...
متن کاملAN ALGORITHM FOR FINDING THE EIGENPAIRS OF A SYMMETRIC MATRIX
The purpose of this paper is to show that ideas and techniques of the homotopy continuation method can be used to find the complete set of eigenpairs of a symmetric matrix. The homotopy defined by Chow, Mallet- Paret and York [I] may be used to solve this problem with 2""-n curves diverging to infinity which for large n causes a great inefficiency. M. Chu 121 introduced a homotopy equation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Pure and Apllied Mathematics
سال: 2016
ISSN: 1311-8080,1314-3395
DOI: 10.12732/ijpam.v111i1.8